#include <iostream>
#include <vector>
#include <list>
using namespace std;
#include "queue.h"
#include "stack.h"
#include "priority_queue.h"
int main() {
	/*A::stack<int> st;
	A::queue<int> q;
	st.push(1);
	st.push(2);
	st.push(3);
	st.pop();

	q.push(1);
	q.push(2);
	q.push(3);
	q.pop();
	cout << st.top() << endl;
	cout << q.front() << endl;*/

	A::priority_queue<int> pq;
	pq.push(4);
	pq.push(1);
	pq.push(5);
	pq.push(7);
	pq.push(9);
	while (!pq.empty())
	{
		cout << pq.top() << " ";
		pq.pop();
	}
	cout << endl;

	return 0;
}